Bounds for DNA Codes with Constant GC-Content
نویسنده
چکیده
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least d. We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters n, d and w.
منابع مشابه
Greedy Construction of DNA Codes and New Bounds
In this paper, we construct linear codes over Z4 with bounded GCcontent. The codes are obtained using a greedy algorithm over Z4. Further, upper and lower bounds are derived for the maximum size of DNA codes of length n with constant GC-content w and edit distance d. keywords: DNA codes, GC-content, edit distance, upper and lower bounds.
متن کاملOn Quantum Codes Obtained From Cyclic Codes Over $\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$
The aim of this paper is to develop the theory for constructing DNA cyclic codes of odd length over R = Z4[u]/〈u 2 − 1〉. Firstly, we relate DNA pairs with a special 16 element of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their deletion distance. The p...
متن کاملConstruction of cyclic DNA codes over the Ring $\Z_4[u]/\langle u^2-1 \rangle $ Based on the deletion distance
In this paper, we develop the theory for constructing DNA cyclic codes of odd length over R = Z4[u]/〈u 2 − 1〉 based on the deletion distance. Firstly, we relate DNA pairs with a special 16 elements of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their de...
متن کاملCorrection: Improved Lower Bounds of DNA Tags Based on a Modified Genetic Algorithm
The well-known massively parallel sequencing method is efficient and it can obtain sequence data from multiple individual samples. In order to ensure that sequencing, replication, and oligonucleotide synthesis errors do not result in tags (or barcodes) that are unrecoverable or confused, the tag sequences should be abundant and sufficiently different. Recently, many design methods have been pro...
متن کاملDNA codes based on additive self-dual codes over GF(4)
In this paper we translate in terms of coding theory constraints that are used in designing DNA codes for use in DNA computing. We focus in particular on linear and additive codes over GF(4), and we propose a new construction for DNA codes satisfying the Hamming distance constraint and the GC-content constraint.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003